Local or Global Minima: Flexible Dual-Front Active Contours
نویسندگان
چکیده
منابع مشابه
Non-local Active Contours
This article introduces a new image segmentation method that makes use of non-local comparisons between pairs of patches of features. A non-local energy is defined by summing the interactions between pairs of patches inside and outside the segmented domain. A maximum radius of interaction can be adapted to fit the amount of variation of the features inside and outside the region to segment. Thi...
متن کاملActive contours with selective local or global segmentation: A new formulation and level set method
A novel region-based active contour model (ACM) is proposed in this paper. It is implemented with a special processing named Selective Binary and Gaussian Filtering Regularized Level Set (SBGFRLS) method, which first selectively penalizes the level set function to be binary, and then uses a Gaussian smoothing kernel to regularize it. The advantages of our method are as follows. First, a new reg...
متن کاملFast 3D Brain Segmentation Using Dual-Front Active Contours with Optional User-Interaction
Important attributes of 3D brain segmentation algorithms include robustness, accuracy, computational efficiency, and facilitation of user interaction, yet few algorithms incorporate all of these traits. Manual segmentation is highly accurate but tedious and laborious. Most automatic techniques, while less demanding on the user, are much less accurate. It would be useful to employ a fast automat...
متن کامل3D Brain Segmentation Using Dual-Front Active Contours with Optional User Interaction
Important attributes of 3D brain cortex segmentation algorithms include robustness, accuracy, computational efficiency, and facilitation of user interaction, yet few algorithms incorporate all of these traits. Manual segmentation is highly accurate but tedious and laborious. Most automatic techniques, while less demanding on the user, are much less accurate. It would be useful to employ a fast ...
متن کاملToward Global Minimum through Combined Local Minima
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local minima solutions can be obtained with simple implementations and usually require smaller computational time than global algorithms. Also, methods such as ICM can be readily implemented in a various difficult problems ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Pattern Analysis and Machine Intelligence
سال: 2007
ISSN: 0162-8828,2160-9292
DOI: 10.1109/tpami.2007.250595